Technical Note—Recognizing Unbounded Integer Programs
نویسندگان
چکیده
منابع مشابه
Symmetries in Integer Programs
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show that any integer program on n variables having an alternating group An as a group of symmetries can be solved in linear time in the number of variables.
متن کاملGomory integer programs
The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomor...
متن کاملDecidable models of integer-manipulating programs with recursive parallelism (technical report)
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a hierarchical fashion, our model is stateextended ground-tree rewrite systems equipped with shared unbounded integer counters that can be incremented, decrement...
متن کاملNonlinear Programs with Unbounded Lagrange Multiplier Sets
We investigate nonlinear programs that have a nonempty but possibly unbounded Lagrange multiplier set and that satisfy the quadraticgrowth condition. We show that such programs can be transformed, by relaxing the constraints and adding a linear penalty term to the objective function, into equivalent nonlinear programs that have diierentiable data and a bounded Lagrange multiplier set and that s...
متن کاملTechnical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1987
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.35.1.140